Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
231	Acta Informatica 18, [removed]Springer-Verlag 1983 The Complexity of Drawing Trees Nicely* Kenneth J. Supowit i and Edward M. Reingold Department of Computer ScienceUniversityof Illinois at Urbana-Champaign Add to Reading List Source URL: emr.cs.iit.edu Language: English - Date: 2010-04-14 09:47:58 Tree traversal Tree T-tree B-tree R-tree Dynamic programming Tango tree Decomposition method Graph theory Binary trees Mathematics
232	This document contains pages extracted from Automatic Quantum Computer Programming: A Genetic Programming Approach, by Lee Spector (Kluwer Academic Publishers, [removed]Only those pages which were used to document the asso Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2006-11-17 21:25:09 Quantum mechanics Models of computation Quantum algorithms Quantum complexity theory Quantum computer Controlled NOT gate Quantum gate Qubit PP Theoretical computer science Applied mathematics Quantum information science
233	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2010-09-02 11:50:35 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
234	Sample Complexity and Performance Bounds for Non-parametric Approximate Linear Programming Jason Pazis and Ronald Parr Department of Computer Science, Duke University Durham, NC 27708 {jpazis,parr}@cs.duke.edu Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2013-04-10 17:56:12 Systems theory Dynamic programming Equations Operations research Stochastic control Lipschitz continuity Optimal control S0 Markov decision process Statistics Mathematical optimization Control theory
235	Compressed Suffix Trees for Repetitive Texts ? Andr´es Abeliuk1,2 and Gonzalo Navarro1 1 Add to Reading List Source URL: www.dcc.uchile.cl Language: English - Date: 2012-11-05 11:21:30 Data management Suffix array Suffix tree Compressed suffix array Trie Kolmogorov complexity Binary tree Computing Computer programming Arrays
236	Pattern matching in pseudo real-time Rapha¨el Clifforda , Benjamin Sacha,∗ a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2010-09-16 04:35:54 String matching algorithms Computational complexity theory Donald Knuth Knuth–Morris–Pratt algorithm Time complexity String searching algorithm Matching Approximate string matching Levenshtein distance Theoretical computer science Applied mathematics Dynamic programming
237	Metrics Frama-C’s metrics plug-in Sodium[removed]Richard Bonichon & Boris Yakobowski Add to Reading List Source URL: frama-c.com Language: English - Date: 2015-03-17 11:33:41 Software Frama-C Cyclomatic complexity Software quality Abstract syntax tree Function point Software metrics Software engineering Computer programming
238	Metrics Frama-C’s metrics plug-in Sodium[removed]Richard Bonichon & Boris Yakobowski Add to Reading List Source URL: frama-c.com Language: English - Date: 2015-03-17 11:33:41 Software Frama-C Cyclomatic complexity Software quality Abstract syntax tree Function point Software metrics Software engineering Computer programming
239	Lower Bounds on Rate of Convergence of Cutting Plane Methods Xinhua Zhang Dept. of Computing Science University of Alberta [removed] Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2010-11-02 20:20:19 Operations research Convex optimization Support vector machines Statistical classification Sequential minimal optimization Linear programming Time complexity Duality Dynamic programming Mathematical optimization Theoretical computer science Applied mathematics
240	Global and reactive routing in urban context: first experiments / first difficulty assessment Pen´elope A. Melgarejo IBM, France Thomas Baudel IBM, France Add to Reading List Source URL: thomas.baudel.name Language: English - Date: 2012-10-30 16:43:40 Computational complexity theory Travelling salesman problem Linear programming Optimization problem Mathematical optimization Constraint programming Shortest path problem Theoretical computer science Mathematics Operations research

UPDATE